A comparative assessment of ensemble learning for credit scoring.

Explore click models for search ranking.

Learning click models via probit bayesian inference.

On the sampling of web images for learning visual concept classifiers.

Hierarchical Construction of Teaching Faculty in Computer Organization and Design.

Comparative object similarity for improved recognition with few or no examples.

Seeing People in Social Context Recognizing People and Social Relationships.

Diagnosis of bearing incipient faults using fuzzy logic based methodology.

Robust Multiuser Precoder for Base Station Cooperative Transmission with Non%2DIdeal Channel Reciprocity.

A New Hybrid Parallel Algorithm for MrBayes.

A Remote Mirroring Architecture with Adaptively Cooperative Pipelining.



An Improved Parallel MEMS Processing%2DLevel Simulation Implementation Using Graphic Processing Unit.

A Recommendation Trust Model Based on E%2Dcommerce Transactions Content%2DSimilarity.

Towards Fast De%2Dduplication Using Low Energy Coprocessor.

Incorporating post%2Dclick behaviors into a click model.

On Diversity Combining with Unknown Channel State Information and Unknown Noise Variance.

Co%2Doptimization of multiple relevance metrics in web search.

Co%2Doptimization of multiple relevance metrics in web search.

iRIN image retrieval in image%2Drich information networks.

On Intrinsic Mode Function.
Gait recognition is an attractive biometric as it is unobtrusive and can be used for recognition from a distance. A number of methods have been proposed by different researchers in the recent past for this purpose. Most of these methods analyze gait as a linear and stationary signal. However, recent research shows that gait is nonlinear and non-stationary. Hence, linear analysis would be insufficient for analysis of gait. In this paper, we present a novel recognition algorithm that derives the feature vector by performing nonlinear, non-stationary analysis of gait using a technique called empirical mode decomposition. We test the algorithm with both noise-free and noisy gait sequences and demonstrate its applicability.
Rotated precoder%2Dbased OFDM system robust to channel spectral nulls and with reduced PAPR.

A new approach to intrusion detection using Artificial Neural Networks and fuzzy clustering.

Fuzzy hyperbolic neural network with time%2Dvarying delays.

T%2DCode 3%2DErasure Longest Lowest%2DDensity MDS Codes.

Knowledge transfer for cross domain learning to rank.

Study on the Drift of Modulated Phase in Interference Fiber Optic Gyroscope.

A regularization framework for multiclass classification A deterministic annealing approach.

A novel learning approach to multiple tasks based on boosting methodology.

Security Primitives for Reconfigurable Hardware%2DBased Systems.

Joint relay assignment and power allocation for cooperative communications.

A Performance Model for Run%2DTime Reconfigurable Hardware Accelerator.

Left Ventricular Strain Analysis from Cine MRI.

To divide and conquer search ranking by learning query difficulty.

Study on NN in Coal Mine Wireless Sensor Networks Link Communication Quality Measurement.

Building text features for object image classification.
We introduce a text-based image feature and demonstrate that it consistently improves performance on hard object classification problems. The feature is built using an auxiliary dataset of images annotated with tags, downloaded from the internet. We do not inspect or correct the tags and expect that they are noisy. We obtain the text feature of an unannotated image from the tags of its k-nearest neighbors in this auxiliary collection. A visual classifier presented with an object viewed under novel circumstances (say, a new viewing direction) must rely on its visual examples. Our text feature may not change, because the auxiliary dataset likely contains a similar picture. While the tags associated with images are noisy, they are more stable when appearance changes. We test the performance of this feature using PAS-CAL VOC 2006 and 2007 datasets. Our feature performs well, consistently improves the performance of visual object classifiers, and is particularly effective when the training dataset is small.
eNSTM a Nested Software Transactional Memory Framework for MPSoC System.

Serial Application Accelerating with Pipelined Configuration Slicing on Dynamic Reconfigurable Hardware.

Approximating Scheduling Machines with Capacity Constraints.

An Exploration Program for Undergraduate Research Training.

Learning Support Service for Distance Learning Curriculum of Information Security.

The input%2Daware dynamic adaptation of area and performance for reconfigurable accelerator.

SnapCDP  A CDP System Based on LVM.

Efficient semidefinite relaxation for energy%2Dbased source localization in sensor networks.

Virtual Prototype Modeling and Fast Dynamic Simulation of the Complete Integrated Sea Trial System for Deep%2DOcean Mining.

Inverse Time Dependency in Convex Regularized Learning.

P%2DpackSVM Parallel Primal grAdient desCent Kernel SVM.

Experimental study on neighbor selection policy for Phoenix Network Coordinate system.

The Performance of Erasure Codes Used in FT%2DMPI.

Network measurement based redundancy model and maintenance in dynamic P2P storage systems.

Reliability Analysis for Full%2D2 Code.

An Improved Parallel Implementation of 3D DRIE Simulation on GPU.

A Batched GPU Algorithm for Set Intersection.

A Markov chain model for integrating behavioral targeting into contextual advertising.

Revenue optimization with relevance constraint in sponsored search.

Performance of cooperative relaying with ARQ in wireless sensor networks.

Spanner%2DAware Relay Node Placement in Wireless Ad Hoc Sensor Networks.

Representing X%2DCode Using Latin Squares.

In%2DMemory Checkpointing for MPI Programs by XOR%2DBased Double%2DErasure Codes.

Optimizing search engine revenue in sponsored search.

Location%2DIndependent Topology Control and Implementation for Wireless Sensor Networks.

Model and Evaluation of Redundant Data Organization for High Availability in Structured Overlay Networks.

Model and Evaluation of Redundant Data Organization for High Availability in Structured Overlay Networks.

Efficient Scratchpad Memory Management Based on Multi%2Dthread for MPSoC Architecture.

Competitive analysis from click%2Dthrough log.

How much can behavioral targeting help online advertising%3F

Understanding user%27s query intent with wikipedia.

Approximating Scheduling Machines with Capacity Constraints


Topology control for delay%2Dconstraint data collection in wireless sensor networks.


Uplink Scheduling Algorithms for QoS Support in Broadband Wireless Access Networks.

A Novel Operating System on Chip with Information Security Support for Embedded System.

An efficient semi%2Dblind source extraction algorithm and its applications to biomedical signal extraction.


Semi%2Dsupervised Classification Using Local and Global Regularization.


Web 2.0 dictionary.

The Application of Event Studies in Evaluation of Teaching Quality.

Object image retrieval by exploiting online knowledge resources.

An Optimal Association Rule Mining Algorithm Based on Knowledge Grid.

A Model of Service Scheduling Based on Market Mechanism and Semantic.

An Improved Parallel Implementation of 3%2DD DRIE Simulation on Multi%2Dcore Processors.

NLOV An Innovative Object%2DOriented Storage System Based on BerkeleyDB.



TransRank A Novel Algorithm for Transfer of Rank Learning.

Constructing Double%2DErasure HoVer Codes Using Latin Squares.

The Practice of Remote Education on Information Security.

Generalizing RDP Codes Using the Combinatorial Method.

Constructing Liberation Codes Using Latin Squares.

A Study of Classification Algorithm for Data Mining Based on Hybrid Intelligent Systems.

Detecting Semantic Mapping of Ontologies with Inference of Description Logic.

ESnapII A Writable Dependent Snapshot System with Shared Cache.

Performance of Soft Decision Metrics and Diversity Combining with Imperfect Channel Estimation.

Churn Impact on Replicated Data Duration in Structured P2P Networks.

An autonomic provisioning framework for outsourcing data center based on virtual appliances.

Impact of transmit power on throughput performance in wireless ad hoc networks with variable rate control.


A New Solution Path Algorithm in Support Vector Regression.
Abstract — Regularization path algorithms were proposed as a novel approach to the model selection problem by exploring the path of possibly all solutions with respect to some regularization hyperparameter in an efficient way. This approach was later extended to a support vector regression (SVR) model called ɛ-SVR. However, the method requires that the error parameter ɛ be set a priori. This is only possible if the desired accuracy of the approximation can be specified in advance. In this paper, we analyze the solution space for ɛ-SVR and propose a new solution path algorithm, called ɛ-path algorithm, which traces the solution path with respect to the hyperparameter ɛ rather than λ. Although both two solution path algorithms possess the desirable piecewise linearity property, our ɛ-path algorithm overcomes some limitations of the original λ-path algorithm and has more advantages. It is thus more appealing for practical use.

MKtrace An Innovative Debugging Tool for Multi%2DThreaded Programs on Multiprocessor Systems.

An Enhanced Dynamic and Distributed Domain%2DBased Handoff Scheme for Mobile IPv6.

OPTIMOL automatic Online Picture collecTion via Incremental MOdel Learning.
A well-built dataset is a necessary starting point for advanced computer vision research. It plays a crucial role in evaluation and provides a continuous challenge to stateof-the-art algorithms. Dataset collection is, however, a tedious and time-consuming task. This paper presents a novel automatic dataset collecting and model learning approach that uses object recognition techniques in an incremental method. The goal of this work is to use the tremendous resources of the web to learn robust object category models in order to detect and search for objects in real-world cluttered scenes. It mimics the human learning process of iteratively accumulating model knowledge and image examples. We adapt a non-parametric graphical model and propose an incremental learning framework. Our algorithm is capable of automatically collecting much larger object category datasets for 22 randomly selected classes from the Caltech 101 dataset. Furthermore, we offer not only more images in each object category dataset, but also a robust object model and meaningful image annotation. Our experiments show that OPTIMOL is capable of collecting image datasets that are superior to Caltech 101 and LabelMe.
K%2DDivided Bloom Filter Algorithm and Its Analysis.

Scalable Semantic Search with Hybrid Concept Index over Structure Peer%2Dto%2DPeer Network.

Application of Fuzzy CMAC to Filament Tension Control.

A Sub%2Dpixel Multifractal Method for the Image Segmentation.

Scalable Semantic Search with Hybrid Concept Index over Structure Peer%2Dto%2DPeer Network.

A Double%2DObjective Genetic Algorithm for Parity Declustering Optimization in Networked RAID.

Appliance%2DBased Autonomic Provisioning Framework for Virtualized Outsourcing Data Center.

Combining static and dynamic defect%2Dtolerance techniques for nanoscale memory systems.
Abstract — Nanoscale technology promises dramatically increased device density, but also decreased reliability. With bit error rates projected to be as high as 10%, designing a usable nanoscale memory system poses a significant challenge. In particular, we need to bootstrap a sea of unreliable bits into contiguous address ranges which are preferably as large as 4Kbyte virtual memory pages. We accomplish this bootstrapping through a combination of dynamic error correction codes within 32-bit blocks and a static defect map which tracks usability of these blocks. The key insight is that statically-determined defect locations can be much more powerful than dynamically correcting for unknown locations, but that defect maps are only practical at a coarse granularity. Using a combination of BCH error correction codes and a Bloom-Filter-based defect map, we achieve a memory efficiency of 60 % and 13 % for 4K-byte pages at 1 % and 10 % bit-error rates, respectively. I.
A kernel path algorithm for support vector machines.
The choice of the kernel function which determines the mapping between the input space and the feature space is of crucial importance to kernel methods. The past few years have seen many efforts in learning either the kernel function or the kernel matrix. In this paper, we address this model selection issue by learning the hyperparameter of the kernel function for a support vector machine (SVM). We trace the solution path with respect to the kernel hyperparameter without having to train the model multiple times. Given a kernel hyperparameter value and the optimal solution obtained for that value, we find that the solutions of the neighborhood hyperparameters can be calculated exactly. However, the solution path does not exhibit piecewise linearity and extends nonlinearly. As a result, the breakpoints cannot be computed in advance. We propose a method to approximate the breakpoints. Our method is both efficient and general in the sense that it can be applied to many kernel functions in common use. 1.
CrossTree A new HTC architecture with high reliability and scalability.

Constructing double%2D and triple%2Derasure%2Dcorrecting codes with high availability using mirroring and parity approaches.

Moats and Drawbridges An Isolation Primitive for Reconfigurable Hardware Based Systems.
Blurring the line between software and hardware, reconfigurable devices strike a balance between the raw high speed of custom silicon and the post-fabrication flexibility of general-purpose processors. While this flexibility is a boon for embedded system developers, who can now rapidly prototype and deploy solutions with performance approaching custom designs, this results in a system development methodology where functionality is stitched together from a variety of “soft IP cores, ” often provided by multiple vendors with different levels of trust. Unlike traditional software where resources are managed by an operating system, soft IP cores necessarily have very fine grain control over the underlying hardware. To address this problem, the embedded systems community requires novel security primitives
PORE Positive%2DOnly Relation Extraction from Wikipedia Text.
Abstract. Extracting semantic relations is of great importance for the creation of the Semantic Web content. It is of great benefit to semi-automatically extract relations from the free text of Wikipedia using the structured content readily available in it. Pattern matching methods that employ information redundancy cannot work well since there is not much redundancy information in Wikipedia, compared to the Web. Multi-class classification methods are not reasonable since no classification of relation types is available in Wikipedia. In this paper, we propose PORE (Positive-Only Relation Extraction), for relation extraction from Wikipedia text. The core algorithm B-POL extends a state-of-the-art positive-only learning algorithm using bootstrapping, strong negative identification, and transductive inference to work with fewer positive training examples. We conducted experiments on several relations with different amount of training data. The experimental results show that B-POL can work effectively given only a small amount of positive training examples and it significantly outperforms the original positive learning approaches and a multi-class SVM. Furthermore, although PORE is applied in the context of Wikipedia, the core algorithm B-POL is a general approach for Ontology Population and can be adapted to other domains. Keywords: Relation Extraction, Ontology Population, Positive-Only Learning 1
Enhancing Relation Extraction by Eliciting Selectional Constraint Features from Wikipedia.

A Hybrid Redundancy Approach for Data Availability in Structured P2P Network Systems.

Combinatorial Constructions of Multi%2Derasure%2DCorrecting Codes with Independent Parity Symbols for Storage Systems.

A Double Level Granularity for Multimedia on Demand System.

Concept Index for Document Retrieval with Peer%2Dto%2DPeer Network.

An Improvement of Coleman Model of Trust Using FNHMS to Manage Reputation in Multi%2Dagent Systems.

Exploring time%2Fresource trade%2Doffs by solving dual scheduling problems with the ant colony optimization.

Vector measure for explicit nonlinear impulsive system of glycerol bioconversion in fed%2Dbatch cultures and its parameter identification.

IT Autopilot A flexible IT service management and delivery platform for small and medium business.

Ant Colony Optimizations for Resource%2D and Timing%2DConstrained Operation Scheduling.

Design and development of Distributed Virtual Geographic Environment system based on web services.

New criteria of global exponential stability for a class of generalized neural networks with time%2Dvarying delays.

WebTraceMiner a web service for processing and mining EST sequence trace files.

Fuzzy Petri Net%2DBased Evaluation to the Process of ERP Implementation.

Using Dependent Regions for Object Categorization in a Generative Framework.
“Bag of words ” models have enjoyed much attention and achieved good performances in recent studies of object categorization. In most of these works, local patches are modeled as basic building blocks of an image, analogous to words in text documents. In most previous works using the “bag of words ” models (e.g. [4, 20, 7]), the local patches are assumed to be independent with each other. In this paper, we relax the independence assumption and model explicitly the inter-dependency of the local regions. Similarly to previous work, we represent images as a collection of patches, each of which belongs to a latent “theme ” that is shared across images as well as categories. We learn the theme distributions and patch distributions over the themes in a hierarchical structure [22]. In particular, we introduce a linkage structure over the latent themes to encode the dependencies of the patches. This structure enforces the semantic connections among the patches by facilitating better clustering of the themes. As a result, our models for object categories tend to be more discriminative than the ones obtained under the independent patch assumption. We show highly competitive categorization results on both the Caltech 4 and Caltech 101 object category datasets. By examining the distributions of the latent themes for each object category, we construct an object taxonomy using the 101 object classes from the Caltech 101 datasets. 1.
Defect%2DTolerant Nanocomputing Using Bloom Filters.
We propose a novel defect-tolerant design methodology using Bloom filters for defect mapping for nanoscale computing devices. It is a general approach that can be used for any permanent defects incurred during the manufacturing process. Our redundant design methodology does not rely on a voting strategy, thus it utilizes the device redundancy more effectively than existing approaches. Additionally, our method does not have false-positive in defect identification, i.e. it will not report a defective device as functional. Moreover, it is very space economic and can be programmed to fit different scales and characteristics of the underlying specific nanoscale devices used in the system. 1
Design space exploration using time and resource duality with the ant colony optimization.

Defect%2DTolerant Nanocomputing Using Bloom Filters.
We propose a novel defect-tolerant design methodology using Bloom filters for defect mapping for nanoscale computing devices. It is a general approach that can be used for any permanent defects incurred during the manufacturing process. Our redundant design methodology does not rely on a voting strategy, thus it utilizes the device redundancy more effectively than existing approaches. Additionally, our method does not have false-positive in defect identification, i.e. it will not report a defective device as functional. Moreover, it is very space economic and can be programmed to fit different scales and characteristics of the underlying specific nanoscale devices used in the system. 1


The Cooperation Behaviors of Multiple Intelligent Virtual Agents Based on the Situation Calculus.

On the use of Bloom filters for defect maps in nanocomputing.

Solution Path for Semi%2DSupervised Classification with Manifold Regularization.

Two%2Ddimensional solution path for support vector regression.
Recently, a very appealing approach was proposed to compute the entire solution path for support vector classification (SVC) with very low extra computational cost. This approach was later extended to a support vector regression (SVR) model called ɛ-SVR. However, the method requires that the error parameter ɛ be set a priori, which is only possible if the desired accuracy of the approximation can be specified in advance. In this paper, we show that the solution path for ɛ-SVR is also piecewise linear with respect to ɛ. We further propose an efficient algorithm for exploring the two-dimensional solution space defined by the regularization and error parameters. As opposed to the algorithm for SVC, our proposed algorithm for ɛ-SVR initializes the number of support vectors to zero and then increases it gradually as the algorithm proceeds. As such, a good regression function possessing the sparseness property can be obtained after only a few iterations. 1.
Fuzzy CMAC with Online Learning Ability and Its Application.

Workpiece Recognition by the Combination of Multiple Simplified Fuzzy ARTMAP.

Adaptive Persistence Utilizing Motion Compensation for Ultrasound Images.

Analyzing XML Parser Memory Characteristics Experiments towards ImprovingWeb Services Performance.

A modified high%2Dradix scalable Montgomery multiplier.

A neural recording system for monitoring shark behavior.

Global exponential stability of generalized neural networks with time%2Dvarying delays.

An Extended Online Fast%2DICA Algorithm.

Local Stability Analysis of Maximum Nongaussianity Estimation in Independent Component Analysis.

New Criteria of Global Exponential Stability for a Class of Generalized Neural Networks with Time%2DVarying Delays.

A Signal%2DDependent Quadratic Time Frequency Distribution for Neural Source Estimation.

Multimodal error correction for continuous handwriting recognition in pen%2Dbased user interfaces.

A Knowledge Grid Architecture Based on Mobile Agent.

Statistical Analysis and Design of HARP FPGAs.

Application partitioning on programmable platforms using the ant colony optimization.

Quality of Service Aware Dynamic Priority Scheduling Scheme for the Mixed Class Multimedia Workloads in the Storage Systems.

The novel generating algorithm and properties of hybrid%2DP%2Dary generalized bridge functions.

Instruction scheduling using MAX%2DMIN ant system optimization.
Instruction scheduling is a fundamental step for mapping an application to a computational device. It takes a behavioral application specification and produces a schedule for the instructions onto a collection of processing units. The objective is to minimize the completion time of the given application while effectively utilizing the computational resources. The instruction scheduling problem is N P-hard, thus effective heuristic methods are necessary to provide a qualitative scheduling solution. In this paper, we present a novel instruction scheduling algorithm using MAX-MIN Ant System Optimization approach. The algorithm utilizes a unique hybrid approach by combining the ant system meta-heuristic with list scheduling, where the local and global heuristics are dynamically adjusted to the input application in an iterative manner. Compared with force-directed scheduling and a number of different list scheduling heuristics, our algorithm generates better results over all the tested benchmarks with better stability. Furthermore, by solving the test samples optimally using ILP formulation, we show that our algorithm consistently achieves a near optimal solution.
Instruction scheduling using MAX%2DMIN ant system optimization.
Instruction scheduling is a fundamental step for mapping an application to a computational device. It takes a behavioral application specification and produces a schedule for the instructions onto a collection of processing units. The objective is to minimize the completion time of the given application while effectively utilizing the computational resources. The instruction scheduling problem is N P-hard, thus effective heuristic methods are necessary to provide a qualitative scheduling solution. In this paper, we present a novel instruction scheduling algorithm using MAX-MIN Ant System Optimization approach. The algorithm utilizes a unique hybrid approach by combining the ant system meta-heuristic with list scheduling, where the local and global heuristics are dynamically adjusted to the input application in an iterative manner. Compared with force-directed scheduling and a number of different list scheduling heuristics, our algorithm generates better results over all the tested benchmarks with better stability. Furthermore, by solving the test samples optimally using ILP formulation, we show that our algorithm consistently achieves a near optimal solution.

Annealed Discriminant Analysis.


HARP hard%2Dwired routing pattern FPGAs.
Modern FPGA architectures provide ample routing resources so that designs can be routed successfully. The routing architecture is designed to handle versatile connection configurations. However, providing such great flexibility comes at a high cost in terms of area, delay and power. We propose a new FPGA routing architecture 1 that utilizes a mixture of hardwired and traditional flexible switches. The result is 24 % reduction in leakage power consumption, 7 % smaller area and 24 % shorter delays, which translates to 30 % increase in clock frequency. Despite the increase in clock speeds, the overall power consumption is reduced by 8%. 1.
A Global Optimization Algorithm for Protein Folds Prediction in 3D Space.

Storage assignment during high%2Dlevel synthesis for configurable architectures.

A Bernoulli Relational Model for Nonlinear Embedding.
The notion of relations is extremely important in mathematics. In this paper, we use relations to describe the embedding problem and propose a novel stochastic relational model for nonlinear embedding. Given some relation among points in a high-dimensional space, we start from preserving the same relation in a low embedded space and model the relation as probabilistic distributions over these two spaces, respectively. We illustrate that the stochastic neighbor embedding and the Gaussian process latent variable model can be derived from our relational model. Moreover we devise a new stochastic embedding model and refer to it as Bernoulli relational embedding (BRE). BRE’s ability in nonlinear dimensionality reduction is illustrated on a set of synthetic data and collections of bitmaps of handwritten digits and face images. 1
Latent Process Model for Manifold Learning.
In this paper, we propose a novel stochastic framework for unsupervised manifold learning. The latent variables are introduced, and the latent processes are assumed to characterize the pairwise relations of points over a high dimensional and a low dimensional space. The elements in the embedding space are obtained by minimizing the divergence between the latent processes over the two spaces. Different priors of the latent variables, such as Gaussian and multinominal, are examined. The Kullback-Leibler divergence and the Bhattachartyya distance are investigated. The latent process model incorporates some existing embedding methods and gives a clear view on the properties of each method. The embedding ability of this latent process model is illustrated on a collection of bitmaps of handwritten digits and on a set of synthetic data. 1
An Agile Method of Modeling Business Process Simulation for Virtual Enterprises.

Global Exponential Stability of a Class of Generalized Neural Networks with Variable Coefficients and Distributed Delays.

Global Convergence of FastICA Theoretical Analysis and Practical Considerations.

Latent Process Model for Manifold Learning.
In this paper, we propose a novel stochastic framework for unsupervised manifold learning. The latent variables are introduced, and the latent processes are assumed to characterize the pairwise relations of points over a high dimensional and a low dimensional space. The elements in the embedding space are obtained by minimizing the divergence between the latent processes over the two spaces. Different priors of the latent variables, such as Gaussian and multinominal, are examined. The Kullback-Leibler divergence and the Bhattachartyya distance are investigated. The latent process model incorporates some existing embedding methods and gives a clear view on the properties of each method. The embedding ability of this latent process model is illustrated on a collection of bitmaps of handwritten digits and on a set of synthetic data. 1
Self%2Dadaptive FastICA Based on Generalized Gaussian Model.

Feature selection with conditional mutual information maximin in text categorization.

Study on Performance of IP%2DSWAN Based on Distributed NS%2DRAID.

A High Performance Application Representation for Reconfigurable Systems.
Modern reconfigurable computing systems feature powerful hybrid architectures with multiple microprocessor cores, large reconfigurable logic arrays and distributed memory hierarchies. Mapping applications to these complex systems requires a representation that allows both hardware and software synthesis. Additionally, this representation must enable optimizations that exploit fine and coarse grained parallelism in order to effectively utilize the performance of the underlying reconfigurable architecture. Our work explores a representation based on the program dependence graph (PDG) incorporated with the static single-assignment (SSA) for synthesis to high performance reconfigurable devices. The PDG effectively describes control dependencies, while SSA yields precise data dependencies. When used together, these two representations provide a powerful, synthesizable form that exploits both fine and coarse grained parallelism. Compared to other commonly used representations for reconfigurable systems, the PDG+SSA form creates faster execution time, while using similar area.
How to Choose Appropriate Function Sets for Gentic Programming.

A New Method for Robust Stability Analysis of a Class of Recurrent Neural Networks with Time Delays.

The Existence of Spurious Equilibrium in FastICA.

UWB microwave imaging for early breast cancer detection effect of two synthetic antenna array configurations.

Automatically detecting deceptive criminal identities.
sed Content Analysis) [7]. Police officers are trained to detect lies by observing nonverbal behaviors, analyzing verbal cues, and/or examining physiological variations. Some are also trained as polygraph examiners. Because of the complexity of deception, there is no universal method to detect all types of deception. Some methods, such as physiological monitoring and behavioral cues examination, can only be conducted while the deception is occurring. Also, there is little research on detecting deception in data where few linguistic patterns exist (for example, profiles containing only names, addresses, and so on). Therefore, existing deception detection techniques developed for applications in communication and physiology are not suitable for discovering deception in identity profiles.  It is a common practice for criminals to lie about the particulars of their identity, such as name, date of birth, address, and Social Security number, in order to deceive a police investigator. For a c
The Modularization of VRML Language in 3D Dynamic On%2DLine Geospatial Courses.

Automatically detecting deceptive criminal identities.
sed Content Analysis) [7]. Police officers are trained to detect lies by observing nonverbal behaviors, analyzing verbal cues, and/or examining physiological variations. Some are also trained as polygraph examiners. Because of the complexity of deception, there is no universal method to detect all types of deception. Some methods, such as physiological monitoring and behavioral cues examination, can only be conducted while the deception is occurring. Also, there is little research on detecting deception in data where few linguistic patterns exist (for example, profiles containing only names, addresses, and so on). Therefore, existing deception detection techniques developed for applications in communication and physiology are not suitable for discovering deception in identity profiles.  It is a common practice for criminals to lie about the particulars of their identity, such as name, date of birth, address, and Social Security number, in order to deceive a police investigator. For a c
Crime Data Mining A General Framework and Some Examples.
By increasing efficiency and reducing errors, crime data mining techniques...
Internet searching and browsing in a multilingual world An experiment on the Chinese Business Intelligence Portal %28CBizPort%29.
this paper, we propose a generic and integrated approach to searching and browsing the Internet in a multilingual world. Based on this approach, we have developed the Chinese Business Intelligence Portal (CBizPort) , a meta-search engine that searches for business information of mainland China, Taiwan, and Hong Kong. Additional functions provided by CBizPort include encoding conversion (between Simplified Chinese and Traditional Chinese), summarization, and categorization. Experimental results of our user evaluation study show that the searching and browsing performance of CBizPort was comparable to that of regional Chinese search engines, and CBizPort could significantly augment these search engines. Subjects&#039; verbal comments indicate that CBizPort performed best in terms of analysis functions, cross-regional searching, and user-friendliness, whereas regional search engines were more efficient and more popular. Subjects especially liked CBizPort&#039;s summarizer and categorizer, which helped in understanding search results. These encouraging results suggest a promising future of our approach to Internet searching and browsing in a multilingual world
Extracting Key Semantic Terms from Chinese Speech Query for Web Searches.
This paper discusses the challenges and proposes a solution to performing information retrieval on the Web using Chinese natural language speech query. The main contribution of this research is in devising a divide-and-conquer strategy to alleviate the speech recognition errors. It uses the query model to facilitate the extraction of main core semantic string (CSS) from the Chinese natural language speech query. It then breaks the CSS into basic components corresponding to phrases, and uses a multi-tier strategy to map the basic components to known phrases in order to further eliminate the errors. The resulting system has been found to be effective.
Crime Data Mining An Overview and Case Studies.

Research and Application of Distributed Fusion System Based on Grid Computing.

CMedPort A Cross%2DRegional Chinese Medical Portal.

A fast algorithm for detection of Chinese lihe words %28poster session%29.

Hierarchical Optimization of Policy%2DCoupled Semi%2DMarkov Decision Processes.
One general strategy for approximately solving large Markov decision processes is &#034;divide-and-conquer&#034;: the original problem is decomposed into sub-problems which interact with each other, but yet can be solved independently by taking into account the nature of the interaction. In this paper we focus on a class of &#034;policy-coupled&#034; semi-Markov decision processes (SMDPs), which arise in many nonstationary real-world multi-agent tasks, such as manufacturing and robotics. The nature of the interaction among sub-problems (agents) is more subtle than that studied previously: the components of a sub-SMDP, namely the available states and actions, transition probabilities and rewards, depend on the policies used in solving the &#034;neighboring&#034; sub-SMDPs. This &#034;strongly-coupled&#034; interaction among subproblems causes the approach of solving each sub-SMDP in parallel to fail. We present a novel approach whereby many variants of each sub-SMDP are solved, explicitly taking into account the different mod...
Registration and Integration of Multiple Object Views for 3D Model Construction.
Automatic 3D object model construction is important in  applications ranging from manufacturing to entertainment, since CAD models of existing objects may be either unavailable or unusable. We describe a prototype system for automatically registering and  integrating multiple views of objects from range data. The results can  then be used to construct geometric models of the objects. New  techniques for handling key problems such as robust estimation of  transformations relating multiple views and seamless integration of  registered data to form an unbroken surface have been proposed and implemented in the system. Experimental results on real surface data  acquired using a digital interferometric sensor as well as a laser range scanner demonstrate the good performance of our system.
Toward the Optimization of a Class of Black Box Optimization Algorithms.
Many black box optimization algorithms have sufficient flexibility to allow them to adapt to the varying circumstances they encounter. These capabilities are of two primary sorts: 1) user-determined choices among alternative parameters, operations, and logic structures, and 2) the algorithm-determined alternative paths chosen during the process of seeking a solution to a particular problem. This paper discusses the process of algorithm design and operation, with the intent of integrating the seemingly distinct aspects described above within a unified framework. We relate this algorithmic optimization process to the field of dynamic process control. An approach is proposed toward the optimization of a process for controlling a specific class of systems, and its application to dynamic adjustment of the algorithm used in the search problem. An instance of this approach in genetic algorithms is demonstrated. The experimental results show the adaptability and robustness of the proposed appr...
The Vectorization of Engineering Drawings Based on Statistics.
radius and thcn approximately express the lines in broken lines [8]. In this paper we present algorithms by using In this paper we choose the run length code as a statistic/geometric features and simulating human primary expression of line drawings for it may contain vision mechanism to extract lines and arcs for all information and is easy to extract skeletons of lines. vcctoriration of engineering drawings. Experimental We propose a statistic vfctorization method which results for complex lint drawings confilm may eliminate noises. improve the precision and speed performances of these algorithms. of recognition.
Parallel Solution of a Traffic Flow Simulation Problem.

The Vectorization of Engineering Drawings Based on Statistics.
radius and thcn approximately express the lines in broken lines [8]. In this paper we present algorithms by using In this paper we choose the run length code as a statistic/geometric features and simulating human primary expression of line drawings for it may contain vision mechanism to extract lines and arcs for all information and is easy to extract skeletons of lines. vcctoriration of engineering drawings. Experimental We propose a statistic vfctorization method which results for complex lint drawings confilm may eliminate noises. improve the precision and speed performances of these algorithms. of recognition.
